-
1 gradient-based algorithm
-
2 algorithm
4-D algorithm4-D descent advisor algorithmaiming algorithmBayesian algorithmBeam-Warming algorithmCFD algorithmCholesky algorithmcommand generation algorithmcomputational fluid dynamics algorithmcontrol algorithmdecomposition algorithmdesign algorithmdiagnosing algorithmdiagnosis algorithmdisplay algorithmengagement algorithmestimation algorithmEuler equation algorithmexplicit-implicit algorithmfeasible directions algorithmfeedback algorithmfilter algorithmfinite-volume algorithmflight management algorithmflight path algorithmflux-split algorithmFMS algorithmfrequency domain algorithmGauss-Newton algorithmgeometry generation algorithmgradient-based algorithmgrid algorithmguidance algorithmgunnery algorithmhidden surface algorithmimage-display algorithmLanczos algorithmleast-squares algorithmLevenberg-Marquardt algorithmlinear quadratic algorithmMacCormack algorithmmaneuver algorithmmaneuvering algorithmmarching algorithmmaximum likelihood estimate algorithmminimum variance algorithmmotion drive algorithmmotion-base drive algorithmmultigrid algorithmNavier-Stokes algorithmNewton-Raphson algorithmnonlinear programming algorithmoptimization algorithmplanning algorithmpole placement algorithmPotter algorithmQR algorithmrelaxation algorithmscheduling algorithmsearch algorithmshock fitting algorithmshock-capturing algorithmspeed profile algorithmspeed selection algorithmstability algorithmstate estimation algorithmsteepest descents algorithmsynthesis algorithmthrust algorithmtime-split algorithmtime-to-go algorithmtrim algorithmtwo-stage algorithm of splittingup-date algorithmupwind algorithmupwind-differenced algorithmvariable-gain algorithmweighted least squareszonal algorithm -
3 image
изображение, образ, изображать, формировать изображение, отображение
– 2-D image
– 3-D image
– image acquisition
– image amplification
– image amplifier
– image analisys system
– image analyzer
– image aspect ratio
– image buffering
– image classification
– image conversion
– image correction
– image creator
– image data
– image decomposition
– image deformation
– image depth analysis
– image description
– image digitizer
– image display
– image distortion
– image element
– image energy
– image enhancement
– image enlargement
– image fault
– image field
– image format
– image formation
– image formation system
– image generation
– image grabbing
– image gradient
– image iconoscop
– image intensity
– image interpretation
– image knowledge
– image memory
– image plane
– image point
– image preprocessing
– image processing
– image processor
– image quantization
– image reading
– image recovery
– image rectification
– image refinement
– image representation
– image resolution
– image restoration
– image scale
– image scanner
– image segment
– image segmentation
– image sensor
– image sharpness
– image shift
– image skeleton
– image smoothing
– image storage
– image structure
– image synthesis
– image transfer
– image translator
– image transmission
– image tube
– image understanding
– image unit
– image-based
– image-based control
– image-based visual servo
– image-flow processing
– image-oriented knowledge
– image-processing system
– image-processing unit
– image-understending algorithm
– image-understending system
См. также в других словарях:
Gradient descent — For the analytical method called steepest descent see Method of steepest descent. Gradient descent is an optimization algorithm. To find a local minimum of a function using gradient descent, one takes steps proportional to the negative of the… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Nonlinear conjugate gradient method — In numerical optimization, the nonlinear conjugate gradient method generalizes the conjugate gradient method to nonlinear optimization. For a quadratic function : The minimum of f is obtained when the gradient is 0: . Whereas linear conjugate… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… … Wikipedia
Memetic algorithm — Memetic algorithms (MA) represent one of the recent growing areas of research in evolutionary computation. The term MA is now widely used as a synergy of evolutionary or any population based approach with separate individual learning or local… … Wikipedia
Simplex algorithm — In mathematical optimization theory, the simplex algorithm, created by the American mathematician George Dantzig in 1947, is a popular algorithm for numerical solution of the linear programming problem. The journal Computing in Science and… … Wikipedia
Watershed (algorithm) — The watershed algorithm is an image processing segmentation algorithm that splits an image into areas, based on the topology of the image. The length of the gradients is interpreted as elevation information. During the successive flooding of the… … Wikipedia
Marr–Hildreth algorithm — In computer vision, the Marr–Hildreth algorithm is a method of detecting edges in digital images, that is continuous curves where there are strong and rapid variations in image brightness. The Marr–Hildreth edge detection method is simple and… … Wikipedia
Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… … Wikipedia
